How good are extrapolated bi-projection methods for linear feasibility problems?

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

How good are extrapolated bi-projection methods for linear feasibility problems?

We consider extrapolated projection methods for solving linear feasibility problems. Both successive and sequential methods of a two-set projection scheme are examined. The best algorithm in the class of algorithms that we considered was an extrapolated sequential method. When this was compared to an interior point method using the CUTEr/Netlib linear programming test problems it was found that...

متن کامل

How good are projection methods for convex feasibility problems?

We consider simple projection methods for solving convex feasibility problems. Both successive and sequential methods are considered, and heuristics to improve these are suggested. Unfortunately, particularly given the large literature which might make one think otherwise, numerical tests indicate that in general none of the variants considered are especially effective or competitive with more ...

متن کامل

Projection Method with Residual Selection for Linear Feasibility Problems

We propose a new projection method for linear feasibility problems. The method is based on the so called residual selection model. We present numerical results for some test problems.

متن کامل

On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints

The effectiveness of projection methods for solving systems of linear inequalities is investigated. It is shown that they often have a computational advantage over alternatives that have been proposed for solving the same problem and that this makes them successful in many real-world applications. This is supported by experimental evidence provided in this paper on problems of various sizes (up...

متن کامل

TR-2009016: On the Effectiveness of Projection Methods for Convex Feasibility Problems with Linear Inequality Constraints

The effectiveness of projection methods for solving systems of linear inequalities is investigated. It is shown that they have a computational advantage over some alternatives and that this makes them successful in real-world applications. This is supported by experimental evidence provided in this paper on problems of various sizes (up to tens of thousands of unknowns satisfying up to hundreds...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Optimization and Applications

سال: 2011

ISSN: 0926-6003,1573-2894

DOI: 10.1007/s10589-011-9414-2